%E. Kranakis, Primality and Cryptography, Wiler-Teubner Series in Computer Science,1986.
%96.  P. Beauchemin, G. Brassard, C. Crépeau, C. Goutier, and C. Pomerance, "The Generation of Random Numbers that are Probably Prime," Journal of Cryptology, v. 1, n. 1, 1988, pp. 53-


@misc{sqft,
  title={{A Simplified Quadratic Frobenius Primality Test}},
  booktitle={IACR Eprint archive},
  url={http://eprint.iacr.org/2005/462},
  author={M. Seysen},
  year={2005}
}

@misc{relic-toolkit,
  author = {D. F. Aranha and C. P. L. Gouv\^{e}a},
  title = {{RELIC is an Efficient Library for Cryptography}},
  howpublished = {\url{http://code.google.com/p/relic-toolkit/}}
}


@misc{iso18032,
   author = {{ISO/IEC 18032}},
   title = {{Information technology - Security techniques - Prime number generation}},
   year = {{2005}},
}



@misc{pinch07,
  author = {R. G. E. Pinch},
  title = {{The Carmichael Numbers up to $10^{21}$ }},
  year = {2007}
}

 
@online{oeis-mills,
  author = {OEIS Foundation Inc.},
  title = {The On-Line Encyclopedia of Integer Sequences},
  month = {janeiro},
  year = {2014},
  note = {\url{http://oeis.org/A051021}},
}


@online{xkcd,
  author = {xkcd},
  title = {Webcomic of romance, sarcasm, math, and language},
  month = {Julho},
  year = {2013},
  note = {\url{http://xkcd.com/247/}},
  url = {http://xkcd.com/}
}

@online{openssl,
  author = {The OpenSSL Core and Development Team},
  title = {OpenSSL: Documents, genrsa(1)},
  month = {julho},
  year = {2013},
  note = {\url{http://www.openssl.org/docs/apps/genrsa.html}},
  url = {http://www.openssl.org/docs/apps/genrsa.html}
}


@Unpublished{prezende-snowden,
  author = 	 {P. A. D. Rezende},
  title = 	 {{O que aprendemos com Edward Snowden?}},
  note = 	 {\url{http://www.cic.unb.br/docentes/pedro/trabs/aprendercsnowden.html}},
  month = {Janeiro},
  year =	{2014}
}


@Unpublished{prezende-vigi,
  author = 	 {P. A. D. Rezende},
  title = 	 {{Como Controlar o Vigilantismo Global?}},
  note = 	 {\url{http://www.cic.unb.br/docentes/pedro/trabs/operamundi.html}},
  month = {Janeiro},
  year =	{2014}
}


@Unpublished{aranha13,
  author = 	 {D. F. Aranha},
  title = 	 {{Cronologia Técnica da Criptografia}},
  note = 	 {\url{https://docs.google.com/file/d/0BwyUaEvgJMOnSFBvQmFUN1Y3OEk/edit}},
  year =	{2013}
}

@Unpublished{rudolf,
  author = 	 {R. R. Maier},
  title = 	 {Teoria dos Números},
  note = 	 {Universidade de Brasília - IE},
  year =	{2005}
}


@Unpublished{aaronson03,
  author = 	 {S. Aaronson},
  title = 	 {{The Prime Facts: From Euclid to AKS}},
  note = 	 {\url{http://www.scottaaronson.com/writings/prime.pdf}},
  year =	{2003}
}


@article{karat63,
  author = 	 {A. Karatsuba and Y. Ofman},
  year = {1963},
  title = 	 {Multiplication of Many-Digital Numbers by Automatic Computers},
  journal =  {Physics-Doklady},
  volume = 	 {7},
  pages = 	 {595--596}
}


@InProceedings{shor94,
  author = 	 {P. W. Shor},
  year = {1994},
  booktitle = 	 {Proceedings of the 35th Annual Symposium on Foundations of Computer Science},
  title = 	 {Algorithms for quantum computation: discrete logarithms and factoring},
  publisher = {IEEE Computer Society Press},
  pages = {124--134}
}


@InProceedings{lenstra02,
  author = 	 {H. W. Lenstra},
  year = {2002},
  booktitle = 	 {Proceedings of the 7th International Colloquium on Automata, Languages and Programming},
  title = 	 {Primality testing with Gaussian periods},
  publisher = {Springer-Verlag}
}

@InProceedings{even80,
  author = 	 {S. Even and Y. Yacobi},
  year = {1980},
  booktitle = 	 {Proceedings of the 7th International Colloquium on Automata, Languages and Programming},
  title = 	 {Cryptography and {NP}-Completeness},
  pages = 	 {195--207},
  publisher = {Springer-Verlag}
}

Primality Testing and Abelian Varieties Over Finite Fields


@Book{adleman92,
  author = 	 {L. M. Adleman and M. A. Huang},
  title = 	 {Primality Testing and Abelian Varieties Over Finite Fields},
  series = {Lecture Notes in Mathematics},
  publisher = 	 {Springer},
  year = 	 {1992}
}

@Book{dietz04,
  author = 	 {M. Dietzfelbinger},
  title = 	 {Primality Testing in Polynomial Time},
  subtitle = {From Randomized Algorithms tp ``PRIME is in P''},
  series = {Lecture Notes in Computer Science},
  publisher = 	 {Springer},
  year = 	 {2004}
}


@Book{finch03,
  author = 	 {S. R. Finch},
  title = 	 {Mathematical Constants},
  publisher = 	 {Cambridge University Press},
  address = {Cambridge},
  year = 	 {2003}
}

@Book{narkiewicz,
  author = 	 {W. Narkiewicz},
  title = 	 {The Development of Prime Number Theory : From Euclid to Hardy and Littlewood},
  publisher = 	 {Springer-Verlag},
  address = {Berlin},
  year = 	 {2000}
}


@Book{euclid,
  author = 	 {Euclid and T. L. Heath (Translator) and D. Densmore (Editor)},
  title = 	 {Euclid's Elements},
  publisher = 	 {Green Lion Press},
  year = 	 {2002},
  volume = 	 {1}
}


@Book{knuth09,
  author = 	 {D. E. Knuth},
  title = 	 {Bitwise tricks & techniques. The Art of Computer Programming},
  publisher = 	 {Addison–Wesley Professional},
  year = 	 {2009},
  volume = 	 {4}
}

@book{ribenboim04,
	author    = {P. Ribenboim},
	title     = {The Little Book of Bigger Primes},
	publisher = {Spring-Verlag},
	address   = {New York},
	year      = {2004}
}

@book{hein09,
	author    = {J. L. Hein},
	title     = {Discrete Structures, Logic, and Computability},
	publisher = {Jones & Bartlett Publishers},
	address   = {Massachusetts},
	year      = {2009}
}


@book{bauer97,
	author    = {F. L. Bauer},
	title     = {Decrypted secrets. Methodsand Maxims of Cryptology},
	publisher = {Springer-Verlag},
	address   = {Berlin},
	year      = {1999}
}



@book{menezes96,
	author    = {A. J. Menezes and P. C. van Oorschot and S. A. Vanstone},
	title     = {Handbook of Applied Cryptography},
	publisher = {CRC Press},
	year      = {1996}
}


@book{bruce96,
	author    = {B. Schneier},
	title     = {Applied Cryptography},
	publisher = {John Wiley \& Sons},
	address   = {New York},
	year      = {1996}
}


@book{oded01,
	author    = {O. Goldreich},
	title     = {Foundations of Cryptography: Basic Techniques},
	publisher = {Cambridge University Press},
	year      = {2001}
}


@book{singh03,
	author    = {S. Singh},
	title     = {The Code Book: How to Make It, Break It, Hack It, Crack It},
	publisher = {Delacorte Press},
	year      = {2003}
}


@book{stinson06,
	author    = {D. R. Stinson},
	title     = {Cryptography: Theory and Practice},
	publisher = {Chapman and Hall/CRC},
	address   = {Florida},
	year      = {2006}
}


@book{kahn67,
	author    = {D. Kahn},
	title     = {The Codebreakers: The Story of Secret Writing},
	publisher = {Macmillan Publishing Co.},
	address   = {New York},
	year      = {1967}
}

@book{henk11,
	author    = {H. C. A. van Tilborg (Editor)},
	title     = {Encyclopedia of Cryptography and Security},
	publisher = {Springer},
	address   = {New York},
	year      = {2005}
}


@book{everest05,
	author    = {G. Everest and T. Ward},
	title     = {An Introduction to Number Theory},
	publisher = {Springer},
	year      = {2005}
}


@book{knuth73,
	author    = {D. E. Knuth},
	title     = {Sorting and Searching. The Art of Computer Programming},
	publisher = {Addison-Wesley},
	year      = {1973}
}


@book{knuth69,
	author    = {D. E. Knuth},
	title     = {Seminumerical Algorithms. The Art of Computer Programming},
	publisher = {Addison-Wesley},
	year      = {1969}
}

@book{knuth68,
	author    = {D. E. Knuth},
	title     = {Fundamental Algorithms. The Art of Computer Programming},
	publisher = {Addison-Wesley},
	year      = {1968}
}


@book{cormen01,
	author    = {T. H. Cormen and C. E. Leiserson and R. L. Rivest and C. Stein},
	title     = {Introduction to Algorithms},
	publisher = {The MIT Press},
	address   = {New York},
	year      = {2001}
}

@book{burton80,
	author    = {D. M. Burton},
	title     = {Elementary Number Theory},
	publisher = {Allyn and Bacon Inc.},
	address   = {Boston},
	year      = {1980}
}

@ARTICLE{self,
    author = {C. Pomerance and J. L. Selfridge and S. Wagstaff},
    title = {The Pseudoprimes to $25\cdot 10^9$},
    journal = {Mathematics of Computation},
    year = {1980},
    volume = {35},
    number = {151},
    pages = {1003--1026}
}


@ARTICLE{baillie,
    author = {R. Baillie and S. Wagstaff},
    title = {Lucas Pseudoprimes},
    journal = {Mathematics of Computation},
    year = {1980},
    volume = {35},
    number = {152},
    pages = {1391--1417}
}

@ARTICLE{koc95,
    author = {Ç. K. Koc},
    title = {Analysis of Sliding Window Techniques for Exponentiation},
    journal = {Computers and Mathematics with Applications},
    year = {1995},
    volume = {30},
    pages = {17--24}
}


@Article{naccache99,
  author = 	 {D. Naccache},
  title = 	 {{Padding Attacks on RSA}},
  journal =  {Information Security Technical Report},
  year = 	 {1999},
  volume = 	 {4},
  number =   {4},
  pages = 	 {28--33}
}


@Article{grantham98,
  author = 	 {J. Grantham},
  title = 	 {A probable prime test with high confidence},
  journal =  {J. Number Theory},
  year = 	 {1998},
  volume = 	 {72},
  number =   {1},
  pages = 	 {32--47}
}


@Article{solovay78,
  author = 	 {R. Solovay and V. Strassen},
  title = 	 {A Fast Monte-Carlo Test for Primality},
  journal =  {SIAM Journal on Computing},
  year = 	 {1978},
  volume = 	 {6},
  number =   {1},
  pages = 	 {84--85}
}


@Article{mills47,
  author = 	 {W. H. Mills},
  title = 	 {A prime-representing function},
  journal = 	 {Bulletin of the American Mathematical Society},
  year = 	 {1947},
  volume = 	 {53},
  number = {6},
  pages = 	 {604}
}



@Article{aks04,
  author = 	 {M. Agrawal and N. Kayal and N. Saxena},
  title = 	 {{PRIMES} is in {P}},
  journal = 	 {Annals of Mathematics},
  year = 	 {2004},
  volume = 	 {160},
  number = 	 {2},
  pages = 	 {781--793}
}


@article{rsa78,
	author   = {R. L. Rivest and A. Shamir and L. Adleman},
	journal  = {Communications ACM},
	volume   = {21},
	number   = {2},
	pages    = {120--126},
	title    = {A method for obtaining digital signatures and public-key cryptosystems},
	year     = {1978}
}


@inproceedings{matsumoto88,
	author   = {T. Matsumoto and H. Imai},
	booktitle= {Advances in Cryptology – CRYPTO},
	pages    = {185--193},
	title    = {On the key predistribution system: A practical solution to the key distribution problem},
	series   = {Lecture Notes in Computer Science},
  	publisher= {Springer},
  	volume   = {293},
	year     = {1987}
}

@Article{piestrak07,
  author = 	 {S. J. Piestrak},
  title = 	 {Efﬁcient hamming weight comparators of binary vectors},
  journal = 	 {Electron. Lett},
  year = 	 {2007},
  volume = 	 {43},
  number = 	 {11},
  pages = 	 {611--612}
}



@article{kerckhoffs83,
	author   = {A. Kerckhoffs },
	journal  = {Journal des Sciences Militaires},
	pages    = {5--38},
	title    = {La Cryptographie militaire},
	volume   = {9},
	number   = {1},
	year     = {1883}
}



@inproceedings{vazirani84,
	author   = {U. V. Vazirani and V. V. Vazirani},
	booktitle= {25th IEEE Symposium on Foundations of Computer Science},
	pages    = {458--463},
	title    = {Efﬁcient and Secure Pseudo-Random Number Generation},
	year     = {1984}
}


@article{shannon49,
	author   = {C. E. Shannon},
	journal  = {Bell System Technical Journal},
	volume   = {28},
	number   = {4},
	pages    = {656--715},
	priority = {0},
	title    = {Communication theory of secrecy systems},
	year     = {1949}
}


@article{diffie76,
	author   = {W. Diffie and M. E. Hellman},
	journal  = {IEEE Transactions on Information Theory},
	volume   = {22},
	number   = {6},
	pages    = {644--654},
	title    = {New directions in cryptography},
	year     = {1976}
}


@article{blum84,
	author   = {M. Blum and S. Micali},
	journal  = {SIAM Journal on Computing},
	volume   = {13},
	number   = {4},
	pages    = {850--864},
	title    = {How to generate cryptographically strong sequences of pseudo-random bits},
	year     = {1984}
}


@article{dongjiang12,
	author   = {L. Dongjiang and W. Yandan},
	journal  = {Journal of Theoretical and Applied Information Technology},
	pages    = {84--87},
	title    = {An optimization algorithm of RSA key generation in embedded system},
	volume   = {46},
	number   = {1},
	year     = {2012}
}



@article{rabin80,
	author   = {M. O. Rabin},
	journal  = {Journal of Number Theory},
	volume   = {12},
	number   = {1},
	pages    = {128--138},
	title    = {Probabilistic algorithm for testing primality},
	year     = {1980}
}


@article{miller76,
	author   = {G. L. Miller},
	journal  = {Journal of Computer and Systems Sciences},
	volume   = {13},
	number   = {3},
	pages    = {300--317},
	title    = {Riemann’s hypothesis and tests for primality},
	year     = {1976}
}

@article{pratt75,
	author   = {V. Pratt},
	journal  = {SIAM Journal on Computing},
	volume   = {4},
	number   = {3},
	pages    = {214--220},
	title    = {Every prime has a succinct certificate},
	year     = {1975}
}


@article{rabin78,
	author   = {M. O. Rabin},
	journal  = {Foundations of Secure Computation},
	pages    = {155--166},
	title    = {Digitalized signatures},
	year     = {1978}
}



@book{mioto99,
	author    = {C. Mioto and M. C. F. Silva and R. E. V. Lopes},
	title     = {Manual de Sintaxe},
	publisher = {Insular},
	address   = {Florian\'opolis},
	year      = {1999}
}

@article{johnson97,
	author   = {D. Johnson and S. Lappin},
	doi      = {10.1023/A:1005328611460},
	journal  = {Linguistics and Philosophy},
	keywords = {linguistics, minimalism},
	month    = {June},
	number   = {3},
	pages    = {273--333},
	priority = {0},
	title    = {A Critique of the Minimalist Program},
	url      = {http://dx.doi.org/10.1023/A:1005328611460},
	volume   = {20},
	year     = {1997}
}


@book{jackendoff97,
	author    = {R. Jackendoff},
	title     = {The Architecture of the Language Faculty},
	year      = {1997},
	address   = {Cambridge, MA},
	publisher = {MIT Press}
}

@book{borsley96,
	author    = {Robert D. Borsley},
	number    = {11},
	publisher = {Blackwell Publishers},
	series    = {Blackwell Textbooks in Linguistics},
	title     = {Modern Phrase Structure Grammar},
	year      = {1996}
}

@article{carpenter91,
	author    = {Bob Carpenter},
	title     = {The Generative Power of {C}ategorial {G}rammars and {H}ead-{D}riven {P}hrase
	             {S}tructure {G}rammars with Lexical Rules},
	journal   = {Computational Linguistics},
	volume    = {17},
	number    = {3},
	year      = {1991},
	issn      = {0891-2017},
	pages     = {301--313},
	publisher = {MIT Press}
}

@book{lyons81,
	author    = {John Lyons},
	title     = {Lingua(gem) e Ling\"{u}\'istica: uma introdu\c{c}\~ao}, 
	publisher = {Zahar},
	address   = {Rio de Janeiro},
	year      = {1981}
}

@book{chomsky65,
	author    = {Noam Chomsky},
	title     = {Aspects of the Theory of Syntax},
	publisher = {MIT Press},
	address   = {Cambridge, MA},
	year      = {1965}
}

@book{chomsky57,
	author    = {Noam Chomsky},
	title     = {Syntatic Structures},
	publisher = {MIT Press},
	address   = {Cambridge, MA},
	year      = {1957}
}

@book{saussure16,
	author    = {Ferdinand de Saussure},
	title     = {Cours de Linguistique G\'en\'erale},
	note      = {\'Edition critique pr\'epar\'ee par {T}ullio de {M}auro},
	publisher = {Payot},
	address   = {Paris},
	year      = {1916}
}
